Derivation of Concurrent Algorithms in Tempo
نویسنده
چکیده
Tempo is a logic programming language that has recently been designed with the aim of allowing concurrent programs to be written in a more declarative manner than existing languages. One of the benefits of declarative programming is the potential for systematic derivation of programs — the subject of this paper. Here we present a few transformation rules that can be applied to Tempo programs, and then describe in detail the derivation of some concurrent algorithms in Tempo. An outline of the Tempo language is also included in order to make the paper self-contained.
منابع مشابه
Tempo: A Declarative Concurrent Programming Language
Tempo is a declarative concurrent programming language based on classical firstorder logic. It improves on traditional concurrent logic programming languages (e.g., Parlog) by explicitly specifying aspects of the behaviour of concurrent programs, namely their safety properties. This provides great advantages in writing concurrent programs and manipulating them while preserving correctness. The ...
متن کاملA logic-based concurrent object-oriented programming language
Parallel computers and distributed systems are becoming increasingly important. Their impressive computation to cost ratios o er a considerable higher performance than that possible with sequential machines. Yet there are few commercial applications written for them. The reason is that programming in these environments is substantially more di cult than programming for sequential machines. In t...
متن کاملDeclarative Concurrent Object-oriented Programming in Tempo++
This paper presents Tempo++, a high-level programming language designed for concurrent object-oriented applications. It is based on a new programming model combining logic programming, constraint solving and object-oriented programming in a uniform framework. Tempo++ is an object-oriented extension to the declarative concurrent programming language Tempo Gregory and Ramirez 95]. It includes ext...
متن کاملFormal derivation of concurrent non-blocking algorithms for real-time systems Confirmation report
متن کامل
Nets, logic and concurrent object-oriented programming
This paper introduces a temporal logic based on precedence constraints among events which captures net semantics, i.e. a particular net can be mapped into a semantic-equivalent formula in the logic. Tempo, a declarative concurrent programming language, is based on such logic and has a procedural interpretation which allows speciications to be executed as concurrent programs. Thus, the execution...
متن کامل